Efficient piecewise-linear function approximation using the uniform metric
نویسندگان
چکیده
منابع مشابه
Efficient Piecewise-Linear Function Approximation Using the Uniform Metric
We give an O(n log n)-time method for nding a best k-link piecewise-linear function approximating an n-point planar data set using the well-known uniform metric to measure the error, 0, of the approximation. Our method is based upon new characterizations of such functions, which we exploit to design an eecient algorithm using a plane sweep in \ space" followed by several applications of the par...
متن کاملEfficient algorithms for function approximation with piecewise linear sigmoidal networks
This paper presents a computationally efficient algorithm for function approximation with piecewise linear sigmoidal nodes. A one hidden layer network is constructed one node at a time using the well-known method of fitting the residual. The task of fitting an individual node is accomplished using a new algorithm that searches for the best fit by solving a sequence of quadratic programming prob...
متن کاملSpace Efficient Approximation of Piecewise Linear Functions
In this work, we compute upper bounds of piecewise linear functions which is a special case of piecewise linear approximation. There are several application areas like pattern recognition or cartography. The goal is to reduce the number of sampling points while still preserving the characteristics of given data. The problem of approximating a given piecewise linear function with n sampling poin...
متن کاملContinuous Piecewise Linear Approximation of BV Function
Nonlinear approximation is widely used in signal processing. Real-life signals can be modeled as functions of bounded variation. Thus the variable knot of approximating function could be selfadaptively chosen by balancing the total variation of the target function. In this paper, we adopt continuous piecewise linear approximation instead of the existing piecewise constants approximation. The re...
متن کاملPiecewise Linear Orthogonal Approximation
We derive Sobolev-type inner products with respect to which hat functions on arbitrary triangulations of domains in R are orthogonal. Compared with linear interpolation, the resulting approximation schemes yield superior accuracy at little extra cost.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1995
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02570717